Untyped Lambda-Calculus with Input-Output
نویسندگان
چکیده
We introduce an untyped-calculus with input-output, based on Gordon's continuation-passing model of input-output. This calculus is intended to allow the classiication of possibly innnite input-output behaviors, such as those required for servers or distributed systems. We deene two terms to be operationally approximate ii they have similar behaviors in any context. We then deene a notion of applicative approximation and show that it coincides with operational approximation for these new behaviors. Last, we consider the theory of pure-terms under this notion of operational equivalence.
منابع مشابه
Lambda - Calculus with Input -
x Abstract. We introduce an untyped-calculus with input-output, based on Gordon's continuation-passing model of input-output. This calculus is intended to allow the classiication of possibly innnite input-output behaviors, such as those required for servers or distributed systems. We deene two terms to be operationally approximate ii they have similar behaviors in any context. We then deene a n...
متن کاملOn the denotational semantics of the untyped lambda-mu calculus
Starting with the idea of reflexive objects in Selinger’s control categories, we define three different denotational models of Parigot’s untyped lambda-mu calculus. The first one is built from an intersection types system for the lambda-mu calculus leading to a generalization of Engeler’s model of the untyped lambda calculus. The second model introduces correlation spaces (coming from Girard’s ...
متن کاملFormal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation
We prove the correctness of an algorithm for normalizing untyped combinator terms by evaluation. The algorithm is written in the functional programming language Haskell, and we prove that it lazily computes the combinatory Böhm tree of the term. The notion of combinatory Böhm tree is analogous to the usual notion of Böhm tree for the untyped lambda calculus. It is defined operationally by repea...
متن کاملReducing Lambda Terms with Traversals
We introduce a method to evaluate untyped lambda terms by combining the theory of traversals, a term-tree traversing technique inspired from Game Semantics, with judicious use of the eta-conversion rule of the lambda calculus. The traversal theory of the simply-typed lambda calculus relies on the eta-long transform to ensure that when traversing an application, there is a subterm representing e...
متن کاملGödelization in the Untyped lambda-Calculus
It is well-known that one cannot inside the pure untyped lambda calculus determine equivalence. I.e., one cannot determine if two terms are beta-equivalent, even if they both have normal forms. This implies that it is impossible in the pure untyped lambda calculus to do Godelisation, i.e. to write a function that can convert a term to a representation of (the normal form of) that term, as equi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996